How to play the one-lie Rényi-Ulam game
نویسندگان
چکیده
The one-lie Rényi-Ulam liar game is a 2-player perfect information zero sum game, lasting q rounds, on the set [n] := {1, . . . , n}. In each round Paul chooses a subset A ⊆ [n] and Carole either assigns 1 lie to each element of A or to each element of [n] \ A. Paul wins the regular (resp. pathological) game if after q rounds there is at least one (resp. at most one) element with one or fewer lies. We exhibit a simple, unified, optimal strategy for Paul to follow in both games, and use this to determine which player can win for all q, n and for both games.
منابع مشابه
The Rényi-Ulam pathological liar game with a fixed number of lies
The q-round Rényi-Ulam pathological liar game with k lies on the set [n] := {1, . . . , n} is a 2-player perfect information zero sum game. In each round Paul chooses a subset A ⊆ [n] and Carole either assigns 1 lie to each element of A or to each element of [n]\A. Paul wins if after q rounds there is at least one element with k or fewer lies. The game is dual to the original Rényi-Ulam liar ga...
متن کاملRényi-Berlekamp-Ulam searching game with bi-interval queries and two lies
We consider the following searching game: there are two players, say Questioner and Responder. Responder chooses a number x ∈ Sn = {1, 2, . . . , n}, Questioner has to find out the number x by asking bi-interval queries and Responder is allowed to lie at most two times throughout the game. The minimal number q(n) of bi-interval queries sufficient to find the unknown integer x is determined for ...
متن کاملProbabilistic Variants of Rényi-ulam Game and Many-valued Logic
In this paper we discuss some generalizations of Rényi-Ulam game with lies: some of them are simply probabilistic variants of it, some others differ from it by the presence of more than one number to guess. In the last part of the paper, we also discuss the relationship between such variants and many-valued logic. This paper is just a survey of known results, but in its last part it also contai...
متن کاملFixed point approach to the Hyers-Ulam-Rassias approximation of homomorphisms and derivations on Non-Archimedean random Lie $C^*$-algebras
In this paper, using fixed point method, we prove the generalized Hyers-Ulam stability of random homomorphisms in random $C^*$-algebras and random Lie $C^*$-algebras and of derivations on Non-Archimedean random C$^*$-algebras and Non-Archimedean random Lie C$^*$-algebras for the following $m$-variable additive functional equation: $$sum_{i=1}^m f(x_i)=frac{1}{2m}left[sum_{i=1}^mfle...
متن کاملDealing with Liars: Misbehavior Identification via Rényi-Ulam Games
We address the problem of identifying misbehaving nodes that refuse to forward packets in wireless multi-hop networks. We map the process of locating the misbehaving nodes to the classic Rényi-Ulam game of 20 questions. Compared to previous methods, our mapping allows the evaluation of node behavior on a per-packet basis, without the need for energy-expensive overhearing techniques or intensive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008